Towards Tractable Algebras for Bags
نویسندگان
چکیده
منابع مشابه
Towards tractable Boolean games
Boolean games are a compact and expressive class of games, based on propositional logic. However, Boolean games are computationally complex: checking for the existence of pure Nash equilibria in Boolean games is Σp2-complete, and it is co-NP-complete to check whether a given outcome for a Boolean game is a pure Nash equilibrium. In this paper, we consider two possible avenues to tractability in...
متن کاملTowards Tractable Inference for Resource-Bounded Agents
For a machine to act with common sense, it is not enough that information about commonsense things be written down in a formal language. What actual knowledge—i.e. conclusions available for informing actions—a formalization is meant to provide cannot be determined without some specification of what sort of reasoning is expected. The traditional view in epistemic logic says that agents see all l...
متن کاملTowards Defeasible Mappings for Tractable Description Logics
We present a novel approach to denote mappings between EL-based ontologies which are defeasible in the sense that such a mapping only applies to individuals if this does not cause an inconsistency. This provides the advantage of handling exceptions automatically and thereby avoiding logical inconsistencies that may be caused due to the traditional type of mappings. We consider the case where ma...
متن کاملTowards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have been identified. In particular, Dunne showed that many problems can be solved in linear time for argumentation frameworks of bounded tree-width. However, these tractability results, which were obtained via Courcelle’s Th...
متن کاملTowards Representation Learning with Tractable Probabilistic Models
Probabilistic models learned as density estimators can be exploited in representation learning beside being toolboxes used to answer inference queries only. However, how to extract useful representations highly depends on the particular model involved. We argue that tractable inference, i.e. inference that can be computed in polynomial time, can enable general schemes to extract features from b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0042